Exact Minimization of Free BDDs and Its Application to Pass-Transistor Logic Optimization
نویسندگان
چکیده
In several design methods for Pass-transistor Logic (PTL) circuits, Boolean functions are expressed as OBDDs in decomposed form and then the component OBDDs are directly mapped to PTL cells. The total size of OBDDs (number of nodes) corresponds to the circuit size. In this paper, we investigate a method for PTL synthesis based on exact minimization of Free BDDs (FBDDs). FBDDs are well-studied extension of OBDDs with free variable ordering on each path. We present statistics showing that more than 56% of 616126 NPN-equivalence classes of 5-variable Boolean functions have minimum FBDDs with less size than their OBDDs. This result can be used for PTL synthesis as libraries. We also applied the exact minimization algorithm of FBDDs to the minimization of subcircuits in the synthesis for MCNC benchmarks and found up to 5% size reduction. key words: Free BDD, Pass-Transistor Logic, Boolean function, logic minimization
منابع مشابه
Decomposition of BDDs with Application to Physical Mapping of Regular PTL Circuits
Non-Crossing Ordered BDDs (NCOBDDs) [3], were proposed for mapping to pass transistor logic (PTL) circuits with very high performance and regular layout. However, the latency and area penalty prevents it to be applied to large circuits. In this paper, we propose a dynamic-programming based approach for decomposition of BDDs. The decomposed BDDs can be applied to construct more compact NCOBDDs t...
متن کاملFast Exact Minimization of BDDsRolf
We present a new exact algorithm for nding the optimal variable ordering for reduced ordered Binary Decision Diagrams (BDDs). The algorithm makes use of a lower bound technique known from VLSI design. Up to now this technique has been used only for theoretical considerations and it is adapted here for our purpose. Furthermore, the algorithm supports symmetry aspects and makes use of a hash-ing ...
متن کاملArea-oriented synthesis for pass-transistor logic
Pass Transistor Logic (PTL) circuits have been successfully used to implement digital ICs which are smaller, faster, and more energy efficient that static CMOS implementations of the same designs. Thus far, most PTL implementations have been handcrafted; as such, designer acceptance of PTL has been limited. In this paper, we develop efficient algorithms for automated synthesis of high quality P...
متن کاملBuuer Minimization in Pass Transistor Logic
Since the technical limits of existing circuit families, such as static CMOS, alternative circuit families are pursued for the development of chips that can operate at speeds signiicantly above 500 MHz. Among them, pass transistor logic (PTL) circuits ooer great promise. Since the delay in a pass-transistor chain is quadratically proportional to its length, and a signal may degenerate when pass...
متن کاملPerformance Driven Synthesis for Pass-Transistor Logic
For many digital designs, implementation in passtransistor logic (PTL) has been shown to be superior in terms of area, timing, and power characteristics to static CMOS. Binary Decision Diagrams (BDDs) have been used for PTL synthesis because of the close relationship between BDDs and PTL. Thus far, BDD optimization for PTL synthesis has targeted minimizing the number of BDD nodes. This strategy...
متن کامل